Computable trees, prime models, and relative decidability
نویسندگان
چکیده
منابع مشابه
Computable Trees, Prime Models, and Relative Decidability
We show that for every computable tree T with no dead ends and all paths computable, and every D >T ∅, there is a D-computable listing of the isolated paths of T . It follows that for every complete decidable theory T such that all the types of T are computable and every D >T ∅, there is a D-decidable prime model of T . This result extends a theorem of Csima and yields a stronger version of the...
متن کاملPrime Models of Theories of Computable Linear Orderings
We answer a long-standing question of Rosenstein by exhibiting a complete theory of linear orderings with both a computable model and a prime model, but no computable prime model. The proof uses the relativized version of the concept of limitwise monotonic function. A linear ordering is computable if both its domain and its order relation are computable; it is computably presentable if it is is...
متن کاملComputable Categoricity versus Relative Computable Categoricity
We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. We show that every 1-decidable computably categorical structure is relatively ∆2-categorical. We study the complexity of various index sets associated with computable categoricity and relative computable categoricity. We also...
متن کاملSelf-Embeddings of Computable Trees
We divide the class of infinite computable trees into three types. For the first and second types, 0 computes a nontrivial self-embedding while for the third type 0 computes a nontrivial self-embedding. These results are optimal and we obtain partial results concerning the complexity of nontrivial selfembeddings of infinite computable trees considered up to isomorphism. We show that every infin...
متن کاملPrime Chains and Pratt Trees
ABSTRACT. We study the distribution of prime chains, which are sequences p1, . . . , pk of primes for which pj+1 ≡ 1 (mod pj) for each j. We first give conditional upper bounds on the length of Cunningham chains, chains with pj+1 = 2pj+1 for each j. We give estimates for P (x), the number of chains with pk 6 x (k variable), and P (x; p), the number of chains with p1 = p and pk 6 px. The majorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2005
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-05-08097-4